Stability of error bounds for convex constraint
نویسندگان
چکیده
5 This paper studies stability of error bounds for convex constraint systems 6 in Banach spaces. We show that certain known sufficient conditions for local 7 and global error bounds actually ensure error bounds for the family of func8 tions being in a sense small perturbations of the given one. A single inequality 9 as well as semi-infinite constraint systems are considered. 10 Mathematics Subject Classification: 49J52, 49J53, 90C30 11
منابع مشابه
Stability of Error Bounds for Convex Constraint Systems in Banach Spaces
This paper studies stability of error bounds for convex constraint systems in Banach spaces. We show that certain known sufficient conditions for local and global error bounds actually ensure error bounds for the family of functions being in a sense small perturbations of the given one. A single inequality as well as semi-infinite constraint systems are considered.
متن کاملStability of Error Bounds for Semi-infinite Convex Constraint Systems
In this paper, we are concerned with the stability of the error bounds for semi-infinite convex constraint systems. Roughly speaking, the error bound of a system of inequalities is said to be stable if all its “small” perturbations admit a (local or global) error bound. We first establish subdifferential characterizations of the stability of error bounds for semi-infinite systems of convex ineq...
متن کاملStability for certain subclasses of harmonic univalent functions
In this paper, the problem of stability for certain subclasses of harmonic univalent functions is investigated. Some lower bounds for the radius of stability of these subclasses are found.
متن کاملError bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
A global error bound is given on the distance between an arbitrary point in the n-dimensional real space R n and its projection on a nonempty convex set determined by m convex, possibly nondiierentiable, inequalities. The bound is in terms of a natural residual that measures the violations of the inequalities multiplied by a new simple condition constant that embodies a single strong Slater con...
متن کاملError bounds for rank constrained optimization problems
This paper is concerned with the rank constrained optimization problem whose feasible set is the intersection of the rank constraint set R = { X ∈ X | rank(X) ≤ κ } and a closed convex set Ω. We establish the local (global) Lipschitzian type error bounds for estimating the distance from any X ∈ Ω (X ∈ X) to the feasible set and the solution set, respectively, under the calmness of a multifuncti...
متن کامل